class Solution:
def removeElement(self, nums: List[int], val: int) -> int:
count = len(nums)
if len(nums) == 0:
return 0
ptr1 = 0
ptr2 = len(nums) -1
for i in range(len(nums)):
if nums[i] == val:
count-=1
while ptr1 != ptr2:
if nums[ptr1] == val:
nums[ptr1] , nums[ptr2] = nums[ptr2], nums[ptr1]
ptr2-=1
else:
ptr1+=1
return count
433A - Kitahara Haruki's Gift | 672A - Summer Camp |
1277A - Happy Birthday Polycarp | 577A - Multiplication Table |
817C - Really Big Numbers | 1355A - Sequence with Digits |
977B - Two-gram | 993A - Two Squares |
1659D - Reverse Sort Sum | 1659A - Red Versus Blue |
1659B - Bit Flipping | 1480B - The Great Hero |
1519B - The Cake Is a Lie | 1659C - Line Empire |
515A - Drazil and Date | 1084B - Kvass and the Fair Nut |
1101A - Minimum Integer | 985D - Sand Fortress |
1279A - New Year Garland | 1279B - Verse For Santa |
202A - LLPS | 978A - Remove Duplicates |
1304A - Two Rabbits | 225A - Dice Tower |
1660D - Maximum Product Strikes Back | 1513A - Array and Peaks |
1251B - Binary Palindromes | 768B - Code For 1 |
363B - Fence | 991B - Getting an A |